II. Molecular diameters
نویسندگان
چکیده
منابع مشابه
Water activity and activation diameters from hygroscopicity data -- Part II
Water activity and activation diameters from hygroscopicity data – Part II: Application to organic species K. A. Koehler, S. M. Kreidenweis, P. J. DeMott, A. J. Prenni, C. M. Carrico, B. Ervens, and G. Feingold Department of Atmospheric Science, Colorado State University, Fort Collins, CO, 80523, USA NOAA, Environmental Technology Laboratory, Boulder, CO, 80303, USA Received: 26 September 2005 ...
متن کاملDiameters of Degree Graphs of Nonsolvable Groups, II
Let G be a finite group and let cd(G) be the set of irreducible character degrees of G. The degree graph ∆(G) is the graph whose set of vertices is the set of primes that divide degrees in cd(G), with an edge between p and q if pq divides a for some degree a ∈ cd(G). It is shown using the degree graphs of the finite simple groups that if G is a nonsolvable group, then the diameter of ∆(G) is at...
متن کاملOphthalmoscopic-Perspectively Distorted Optic Disc Diameters and Real Disc Diameters.
PURPOSE To investigate the difference between two-dimensionally measured disc diameters (DDs) based on fundus images and three-dimensionally measured DDs based on enhanced depth imaging optical coherence tomography (EDI-OCT). METHODS The DDs were three-dimensionally measured on EDI-OCT images of optic nerve heads and two-dimensionally measured on near-infrared reflectance fundus images in 90 ...
متن کاملDiameters of Cayley Graphs
We show that for integers k ≥ 2 and n ≥ 3, the diameter of the Cayley graph of SLn(Z/kZ) associated to a standard two-element generating set, is at most a constant times n 2 ln k. This answers a question of A. Lubotzky concerning SLn(Fp) and is unexpected because these Cayley graphs do not form an expander family. Our proof amounts to a quick algorithm for finding short words representing eleme...
متن کاملDiameters and Eigenvalues
We derive a new upper bound for the diameter of a k-regular graphG as a function of the eigenvalues of the adjacency matrix. Namely, supposethe adjacency matrix of G has eigenvalues AI , A2 .••.• An with lAd:::: IA21 ::::... :::: IAnl where AI = k, A = IA21. Then the diameter D(G) must satisfy D(G) :::; rlog(n 1)f1og(k/A)l. We wilJ consider families of graphs whose eigenvalues can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science
سال: 1910
ISSN: 1941-5982,1941-5990
DOI: 10.1080/14786440108636774